Compression Schemes, Stable Definable Families, and o-Minimal Structures
نویسندگان
چکیده
We show that any family of sets uniformly definable in an ominimal structure has an extended compression scheme of size equal to the number of parameters in the defining formula. As a consequence, the combinatorial complexity (or density) of any definable family in a structure with a o-minimal theory is bounded by the number of parameters in the defining formula. ∗Partially supported by NSF grant DMS-0600217.
منابع مشابه
Cutting lemma and Zarankiewicz's problem in distal structures
We establish a cutting lemma for definable families of sets in distal structures, as well as the optimality of the distal cell decomposition for definable families of sets on the plane in ominimal expansions of fields. Using it, we generalize the results in [10] on the semialgebraic planar Zarankiewicz problem to arbitrary o-minimal structures, in particular obtaining an o-minimal generalizatio...
متن کاملTame topology over dp-minimal structures
In this paper we develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable sets, definable functions are almost everywhere continuous, and definable sets are finite unions of graphs of definable continuous “multi-valued f...
متن کاملOn Definable Skolem Functions in Weakly O-Minimal nonvaluational Structures
We prove that all known examples of weakly o-minimal non-valuational structures have no de nable Skolem functions. We show, however, that such structures eliminate imaginaries up to de nable families of cuts. Along the way we give some new examples of weakly ominimal non-valuational structures.
متن کاملDefinable Structures in O-minimal Theories: One Dimensional Types
Let N be a structure definable in an o-minimal structureM and p ∈ SN (N), a complete N -1-type. If dimM(p) = 1 then p supports a combinatorial pre-geometry. We prove a Zilber type trichotomy: Either p is trivial, or it is linear, in which case p is non-orthogonal to a generic type in an N -definable (possibly ordered) group whose structure is linear, or, if p is rich then p is non-orthogonal to...
متن کاملA note on superstable groups
It is proved that all groups of finite U -rank that have the descending chain condition on definable subgroups are totally transcendental. A corollary is that any stable group that is definable in an o-minimal structure is totally transcendental of finite Morley rank. Motivation for this paper is a problem concerning stable groups definable in ominimal structures. One theorem is that any defina...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 43 شماره
صفحات -
تاریخ انتشار 2010